Order Transitive oriented 3-hypergraphs of cyclic orders
نویسندگان
چکیده
In this paper we introduce the definition of transitivity for oriented $3$--hypergraphs in order to study partial and complete cyclic orders. This definition allow us to give sufficient conditions on a partial cyclic order to be totally extendable. Furthermore, we introduce the $3$-hypergraph associated to a cyclic permutation and characterize it in terms of cyclic comparability $3$-hypergraphs. Response to Reviewers: We have implemented all changes suggested by the reviewers Powered by Editorial Manager® and Preprint Manager® from Aries Systems Corporation Transitive oriented 3–Hypergraphs of cyclic orders 1 Natalia Garcia-Colin∗, Amanda Montejano†, Luis Montejano‡, Deborah Oliveros§ Universidad Nacional Autónoma de México, México 2
منابع مشابه
Searching for perfection on hypergraphs
In this paper we study the family of oriented transitive 3–hypergraphs that arrive from cyclic permutations and intervals in the circle to search for the notion of perfection on hypergraphs.
متن کاملVertex-transitive self-complementary uniform hypergraphs
In this paper we examine the orders of vertex-transitive self-complementary uniform hypergraphs. In particular, we prove that if there exists a vertex-transitive selfcomplementary k-uniform hypergraph of order n, where k = 2 or k = 2 + 1 and n ≡ 1 (mod 2), then the highest power of any prime dividing n must be congruent to 1 modulo 2. We show that this necessary condition is also sufficient in ...
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملSelf-Complementary Hypergraphs
In this thesis, we survey the current research into self-complementary hypergraphs, and present several new results. We characterize the cycle type of the permutations on n elements with order equal to a power of 2 which are k-complementing. The k-complementing permutations map the edges of a k-uniform hypergraph to the edges of its complement. This yields a test to determine whether a finite p...
متن کاملar X iv : m at h / 06 06 58 5 v 1 [ m at h . C O ] 2 3 Ju n 20 06 HAMILTONICITY OF VERTEX - TRANSITIVE GRAPHS OF ORDER 4 p
It is shown that every connected vertex-transitive graph of order 4p, where p is a prime, is hamiltonian with the exception of the Coxeter graph which is known to possess a Hamilton path. In 1969, Lovász [22] asked if every finite, connected vertex-transitive graph has a Hamilton path, that is, a path going through all vertices of the graph. With the exception of K 2 , only four connected verte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012